Graph Grammars and Operations on Graphs
نویسنده
چکیده
graph, 18algebra, 41alphabet, 6ordinary, 6ranked, 6typed, 9AMS-LaTEX, ii, 111attackproblems worthy of, iii, 4 backfoldin terms of split, 45backfolding, 44closure under, 86Baeten, Berth, 112base setfull, 42sequential, 41Bauderon, Michel, 96, 104, 106, 107BC-hypergraph, 96graph grammar using, 97binary tree, 56, 102Borsboom, Gerard, 111bounded cutwidth, 23, 102theorem on, 54bounded degree, 23, 102theorem on, 54 cardinality, 5CF, 7, 114CFHG, 97, 98, 102Chomsky hierarchy, 2closuresummary table, 89under +{Un}, {Un}+, 85under backfolding, 86under concatenation, 83under edge relabeling, 88under flipping, 86under folding, 86under Kleene closure, 84under parallel composition, 86under sequential composition, 83under splitting, 88under union, 84combinatorics, 41compositionparallel, 3, 28relation between sequential and paral-lel, 29sequential, 1, 25concatenation, 10, 27closure under, 83concrete graph, 18context-free grammar, 7context-free hypergraph grammar, 97context-free language, 7correctly internally typed, 9Courcelle, Bruno, 96, 104, 106, 107cut, 20cutwidth, 20bounded, 23, 102lemma on, 20van Dantzich, Maarten, 111DB, 7, 114decomposition, 3, 33full, 33sequential, 33definitionsregarding alphabets, 6regarding classes of languages, 7regarding functions, 6regarding grammars, 7regarding logic, 6regarding numbers, 5
منابع مشابه
Characteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...
متن کاملSome New Results On the Hosoya Polynomial of Graph Operations
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
متن کاملApplications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کاملSome results on Bipolar Fuzzy Graph
In this paper, the notion ofgraph operationsdisjunction and symmetric difference on bipolar fuzzy graphs are defined and it is proved that the new graph is a bipolar graph. Furthermore,the new concepts of bipolar fuzzy graphs calledupperstrong and lower strongbipolar fuzzy graphare introduced and some related </...
متن کاملGraph product of generalized Cayley graphs over polygroups
In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.
متن کاملOn exponential domination and graph operations
An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993